Cycle Vector Space Algorithms for Enumerating All Cycles of a Planar Graph
نویسنده
چکیده
We present a new and elegant cycle vector space algorithm that runs in O(n 2) steps and needs O(n) space for enumerating all the cycles of a planar graph with n vertices, where is the total number of simple cycles in the graph. Unlike backtrack algorithms, cycle vector space algorithms for this problem are suitable for parallelization. A parallel version of this algorithm along with a parallel version of Syslo's O(n) step algorithm for the same problem are given on an exclusive-read, exclusive-write parallel RAM model with p processors. The results of an implementation of our parallel algorithm on a mesh-connected SIMD computer are also presented.
منابع مشابه
Parallel Algorithms for Finding Cycles and Cutsets of Graphs
We rst present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding ...
متن کاملVector Space semi-Cayley Graphs
The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملGraph Algorithms for Constructing and Enumerating Cycles and Related Structures
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ville Pettersson Name of the doctoral dissertation Graph Algorithms for Constructing and Enumerating Cycles and Related Structures Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 127/2015 Field of research Information ...
متن کاملMinimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time
A minimum cycle basis of a weighted undirected graph G is a basis of the cycle space of G such that the total weight of the cycles in this basis is minimized. If G is a planar graph with non-negative edge weights, such a basis can be found in O(n2) time and space, where n is the size of G. We show that this is optimal if an explicit representation of the basis is required. We then present an O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995